Supramolecular Recognition in Crystalline Nanocavities through Monte Carlo and Voronoi Network Algorithms

نویسندگان

چکیده

Computational screening of templating molecules enables the discovery new synthesis routes for zeolites. Despite decades work in molecular modeling organic structure-directing agents (OSDAs), development and benchmarking algorithms docking nanoporous materials has received scarce attention. Here, we introduce Voronoi Organic–Inorganic Docker (VOID), a method based on diagrams to dock crystalline materials, release it as Python package. Benchmarks implementation show that generates docked poses up 95 times faster than traditional Monte Carlo scheme. We then evaluate algorithm by obtaining binding energies about 120 zeolite–OSDA pairs industrial relevance. The computed host–guest interactions qualitatively explain experimental outcomes from literature. results further suggest OSDAs synthesize known Finally, exemplify generality VOID inside metal–organic framework metal surface. proposed software provide low-cost computational approach generating molecule–material interfaces.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Population Monte Carlo algorithms

We give a cross-disciplinary survey on “population” Monte Carlo algorithms. In these algorithms, a set of “walkers” or “particles” is used as a representation of a high-dimensional vector. The computation is carried out by a random walk and split/deletion of these objects. The algorithms are developed in various fields in physics and statistical sciences and called by lots of different terms – ...

متن کامل

Monte-Carlo Search Algorithms

We have explored and tested the behavior of Monte-Carlo Search Algorithms in both artificial and real game trees. Complementing the work of previous WPI students, we have expanded the Gomba Testing Framework; a platform for the comparative evaluation of search algorithms in large adversarial game trees. We implemented and analyzed the specific UCT algorithm PoolRAVE by developing and testing va...

متن کامل

Active Monte Carlo Recognition

In this paper we introduce Active Monte Carlo Recognition (AMCR), a new approach for object recognition. The method is based on seeding and propagating ”relational” particles that represent hypothetical relations between low-level perception and high-level object knowledge. AMCR acts as a filter with each individual step verifying fragments of different objects, and with the sequence of resulti...

متن کامل

Monte-Carlo algorithms for the planar multiterminal network reliability problem

This paper presents a general framework for the construction of Monte-Carlo algorithms for the solution of enumeration problems. As an application of the general framework, a Monte-Carlo method is constructed for estimating the failure probability of a multiterminal planar network whose edges are subject to independent random failures. The method is guaranteed to be effective when the failure p...

متن کامل

Utilizing Network Structure to Accelerate Markov Chain Monte Carlo Algorithms

We consider the problem of estimating the measure of subsets in very large networks. A prime tool for this purpose is the Markov Chain Monte Carlo (MCMC) algorithm. This algorithm, while extremely useful in many cases, still often suffers from the drawback of very slow convergence. We show that in a special, but important case, it is possible to obtain significantly better bounds on the converg...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Physical Chemistry C

سال: 2021

ISSN: ['1932-7455', '1932-7447']

DOI: https://doi.org/10.1021/acs.jpcc.0c10108